Importance functions for restart simulation of general Jackson networks

نویسنده

  • José Villén-Altamirano
چکیده

RESTART is an accelerated simulation technique that allows the evaluation of extremely low probabilities. In this method a number of simulation retrials are performed when the process enters regions of the state space where the chance of occurrence of the rare event is higher. These regions are defined by means of a function of the system state called the importance function. Guidelines for obtaining suitable importance functions and formulas for the importance function of two-stage networks were provided in previous papers. In this paper, we obtain effective importance functions for RESTART simulation of Jackson networks where the rare set is defined as the number of customers in a particular ('target') node exceeding a predefined threshold. Although some rough approximations and assumptions are used to derive the formulas of the importance functions, they are good enough to estímate accurately very low probabilities for different network topologies within short computational time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combination of Approximation and Simulation Approaches for Distribution Functions in Stochastic Networks

This paper deals with the fundamental problem of estimating the distribution function (df) of the duration of the longest path in the stochastic activity network such as PERT network. First a technique is introduced to reduce variance in Conditional Monte Carlo Sampling (CMCS). Second, based on this technique a new procedure is developed for CMCS. Third, a combined approach of simulation and ap...

متن کامل

Extension of heuristics for simulating population overflow in Jackson tandem queuing networks to non-Markovian tandem queuing networks

In this paper we extend previously proposed state-dependent importance sampling heuristics for simulation of population overflow in Markovian tandem queuing networks to nonMarkovian tandem networks, and experimentally demonstrate the asymptotic efficiency of the resulting heuristics.

متن کامل

Dynamic Importance Sampling for Queueing Networks

Importance sampling is a technique that is commonly used to speed up Monte Carlo simulation of rare events. However, little is known regarding the design of efficient importance sampling algorithms in the context of queueing networks. The standard approach, which simulates the system using an a priori fixed change of measure suggested by large deviation analysis, has been shown to fail in even ...

متن کامل

RESTART simulation of non-Markov consecutive-k-out-of-n: F repairable systems

ARTICLE INFO ABSTRACT Keywords: Dependability Consecutive-k-out-of-n: F repairable system Rare-event simulation RESTART The reliability of consecutive-fc-out-of-n: F repairable systems and (fc-l)-step Markov dependence is studied. The model analyzed in this paper is more general than those of previous studies given that repair time and component lifetimes are random variables that follow a gene...

متن کامل

Importance sampling for Jackson networks

Rare event simulation in the context of queueing networks has been an active area of research for more than two decades. A commonly used technique to increase the efficiency of Monte Carlo simulation is importance sampling. However, there are few rigorous results on the design of efficient or asymptotically optimal importance sampling schemes for queueing networks. Using a recently developed ga...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • European Journal of Operational Research

دوره 203  شماره 

صفحات  -

تاریخ انتشار 2010